Another View on the SSS* Algorithm
نویسندگان
چکیده
A new version of the SSS* algorithm for searching game trees is presented. This algorithm is built around two recursive procedures. It nds the minimax value of a game tree by rst establishing an upper bound to this value and then successively trying in a top down fashion to tighten this bound until the minimax value has been obtained. This approach has several advantages, most notably that the algorithm is more perspicuous. Correctness and several other properties of SSS* can now more easily be proven. As an example we prove Pearl's characterization of the nodes visited by SSS* Pl].
منابع مشابه
Soft Subdivision Search in Motion Planning
The main paradigm for practical motion planning in the last two decades is Probabilistic Road Map (PRM). We propose an alternative paradigm called Soft Subdivision Search (SSS). The SSS approach is based on two ingredients: the standard subdivision of space, coupled with soft predicates. Such predicates are conservative and convergent relative to exact predicates. This leads to a new class of r...
متن کاملA Genetic Algorithm based Optimization Method in 3D Solid Reconstruction from 2D Multi-View Engineering Drawings
There are mainly two categories for a 3D reconstruction from 2D drawings: B-Rep and CSG that both these methods have serious weaknesses despite being useful. B-Rep method which has been older and have wider function range is problematic because of high volume of calculations and vagueness in answers and CSG method has problem in terms of very limited range of volumes and drawings that it can an...
متن کاملProceedings of the 1st Workshop on Robotics Challenges and Vision (RCV2013)
The main paradigm for practical motion planning in the last two decades is Probabilistic Road Map (PRM). We propose an alternative paradigm called Soft Subdivision Search (SSS). The SSS approach is based on two ingredients: the standard subdivision of space, coupled with soft predicates. Such predicates are conservative and convergent relative to exact predicates. This leads to a new class of r...
متن کاملAnother View of the Classical Problem of Comparing Two Probabilities
The usual calculation of the P-value for the classical problem of comparing probabilities is not always accurate. This issue arose in the context of a legal dispute which depended on when some written material was written in a diary. The problem raises some issues on the foundations of statistical inference.
متن کامل